Voice activity detection method based on multivalued coarse-graining Lempel-Ziv complexity
نویسندگان
چکیده
منابع مشابه
Voice activity detection method based on multivalued coarse-graining Lempel-Ziv complexity
One of the key issues in practical speech processing is to locate precisely endpoints of the input utterance to be free of nonspeech regions. Although lots of studies have been performed to solve this problem, the operation of existing voice activity detection (VAD) algorithms is still far away from ideal. This paper proposes a novel robust feature for VAD method that is based on multi-valued c...
متن کاملElectroencephalogram Lempel-Ziv Complexity analysis in Alzheimer’s Disease with different Coarse Graining Techniques
This work explores the possible benefits of adopting k-means as a coarse graining technique (CGT) when measuring electroencephalograms (EEG) complexity using the Lempel-Ziv (LZ) algorithm for the diagnosis of Alzheimer’s disease (AD). A significant (p<0.01) complexity decrease between AD patients and control subjects is identified at Occipital, Parietal and Temporal regions of the brain. An acc...
متن کاملLempel-Ziv complexity analysis of local field potentials in different vigilance states with different coarse-graining techniques
Analysis of electrophysiological signals recorded from the brain with Lempel-Ziv (LZ) complexity, a measure based on coarse-graining of the signal, can provide valuable insights into understanding brain activity. LZ complexity of local field potential signals recorded from the neocortex of 11 adult male Wistar-Kyoto rats in different vigilance states – waking, non-rapid-eye movement (NREM) and ...
متن کاملA Risk Stratification System to Discriminate Congestive Heart Failure Patients Using Multi- Valued Coarse-graining Lempel-ziv Complexity
A risk stratification system to discriminate congestive heart failure (CHF) subjects from healthy subjects is proposed. All the previous research to detect CHF patients using Lempel-Ziv complexity measure had used binary coarsegraining (BLZC). In this work, we show that employing multi-valued coarsegraining Lempel-Ziv complexity (MLZC) improves the performance of classification. This finding is...
متن کاملOn Lempel-Ziv Complexity of Sequences
We derive recurrences for counting the number a(n, r) of sequences of length n with Lempel-Ziv complexity r, which has important applications, for instance testing randomness of binary sequences. We also give algorithms to compute these recurrences. We employed these algorithms to compute a(n, r) and expected value, EPn, of number of patterns of a sequence of length n, for relatively large n. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2011
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis100906032z